#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

ll n, p, q;
struct Node {
  ll k, a, b;
  bool operator<(Node x) const {
    if (k != x.k) return k < x.k;
    if (a != x.a)
      return a < x.a;
    else
      return b < x.b;
  }
};
void solve() {
  Node res{(1LL << 32), 32, 32};
  rep(a, 0, 31) rep(b, 0, 31) {
    ll x = (p + (p << a)) >> b;
    if (x >= q) {
      ll y = (n - 1) * p;
      y = (y + (y << a)) >> b;
      Node now{y + q, a, b};
      if (now < res) res = now;
    }
  }
  cout << res.k << ' ' << res.a << ' ' << res.b << endl;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  while (cin >> n >> p >> q) {
    solve();
  }
  return 0;
}